Representation Theory of a Graph
نویسندگان
چکیده
article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract In this work, we study a generalization of the concept of modules by considering more general setting which is called OG-diagrams. We use Higman criteria and relative projectivity as the main tools to get our results. 1 Preliminaries Module theory is one modern approach to study algebras. Our main concern is to use graph theory to generalize some module theory in the present of special graph(Chapter 1, Section 5 in [2]) which we can define as follows:
منابع مشابه
dominating subset and representation graph on topological spaces
Let a topological space. An intersection graph on a topological space , which denoted by , is an undirected graph which whose vertices are open subsets of and two vertices are adjacent if the intersection of them are nonempty. In this paper, the relation between topological properties of and graph properties of are investigated. Also some classifications and representations for the graph ...
متن کاملFinite groups admitting a connected cubic integral bi-Cayley graph
A graph is called integral if all eigenvalues of its adjacency matrix are integers. Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$. In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.
متن کاملProduct version of reciprocal degree distance of composite graphs
A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.
متن کاملExplaining the Methods of Architecture Representation Using Semiotic Analysis (Umberto Eco's Theory of Architecture Codes)
: In this paper, it is tried to explain the concept of representation and architectural representation through a qualitative methodology, approach its procedure for gradual creation in architecture and then according to scholars and to obtain the effect of this concept in the process of architectural facts the concepts are presented. In addition, it is referred to theories and practical texts b...
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملSolving a nurse rostering problem considering nurses preferences by graph theory approach
Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...
متن کامل